Infinite classes of counter-examples to the Dempster’s rule of combination
نویسندگان
چکیده
This paper presents several classes of fusion problems which cannot be directly attacked by the classical mathematical theory of evidence, also known as the Dempster-Shafer Theory (DST) either because the Shafer’s model for the frame of discernment is impossible to obtain or just because the Dempster’s rule of combination fails to provide coherent results (or no result at all). We present and discuss the potentiality of the DSmT combined with its classical (or hybrid) rule of combination to attack these infinite classes of fusion problems.
منابع مشابه
Counter - examples to Dempster ’ s rule of combination
This chapter presents several classes of fusion problems which cannot be directly approached by the classical mathematical theory of evidence, also known as Dempster-Shafer Theory (DST), either because Shafer’s model for the frame of discernment is impossible to obtain, or just because Dempster’s rule of combination fails to provide coherent results (or no result at all). We present and discuss...
متن کاملOn the behavior of Dempster’s rule of combination
In this paper we present simple examples showing the insensitivity of Dempster’s rule of combination proposed in Dempster-Shafer Theory (DST) of evidence with respect to the level of conflict between two sources of evidences. Aside famous Zadeh’s example on the validity of Dempster’s rule of combination, it is shown that for an infinite number of cases Dempster’s rule does not respond adequatel...
متن کاملDempster's Rule as Seen by Little Colored Balls
Dempster’s rule is traditionally interpreted as an operator for fusing belief functions. While there are different types of belief fusion, there has been considerable confusion regarding the exact type of operation that Dempster’s rule performs. Many alternative operators for belief fusion have been proposed, where some are based on the same fundamental principle as Dempster’s rule, and others ...
متن کاملThe SDL Combination Rule of Evidence
In this paper one proposes a new simple combination rule, similar to Dempster’s rule, but the normalization is done for each set with respect to the non-zero sum of its corresponding mass matrix. A general formula is proposed with several numerical examples and comparisons with other rules for combination of evidence published in literature.
متن کاملGeneralized to DSm Hyper - power Sets and their Comparison with the Hybrid DSm Rule
Dempster’s rule, non-normalized conjunctive rule, Yager’s rule and Dubois-Prade’s rule for belief functions combination are generalized to be applicable to hyper-power sets according to the DSm theory. A comparison of the rules with DSm rule of combination is presented. A series of examples is included.
متن کامل